Construction of mean-square Lyapunov-basins for random ordinary differential equations

نویسندگان

چکیده

We propose a straightforward basin search algorithm to determine suitably large level set of the mean-square Lyapunov-function that corresponds linearization about an path-wise equilibrium solution random ordinary differential equation (RODE). Noise intensity plays crucial role for how similar behavior solutions RODEs is compared corresponding deterministic system. In this regards, also allows numerically estimate up which noise intensities linearized asymptotic stability remains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mean Square Numerical Methods for Initial Value Random Differential Equations

Randomness may exist in the initial value or in the differential operator or both. In [1,2], the authors discussed the general order conditions and a global convergence proof is given for stochastic Runge-Kutta methods applied to stochastic ordinary differential equations (SODEs) of Stratonovich type. In [3,4], the authors discussed the random Euler method and the conditions for the mean square...

متن کامل

Matrix Lyapunov Inequalities for Ordinary and Elliptic Partial Differential Equations

This paper is devoted to the study of Lp Lyapunov-type inequalities for linear systems of equations with Neumann boundary conditions and for any constant p ≥ 1. We consider ordinary and elliptic problems. The results obtained in the linear case are combined with Schauder fixed point theorem to provide new results about the existence and uniqueness of solutions for resonant nonlinear problems. T...

متن کامل

Unsupervised kernel least mean square algorithm for solving ordinary differential equations

In this paper a novel method is introduced based on the use of an unsupervised version of kernel least mean square (KLMS) algorithm for solving ordinary differential equations (ODEs). The algorithm is unsupervised because here no desired signal needs to be determined by user and the output of the model is generated by iterating the algorithm progressively. However, there are several new impleme...

متن کامل

Polynomial Chaos Expansions for Random Ordinary Differential Equations

We consider numerical methods for finding approximate solutions to Ordinary Differential Equations (ODEs) with parameters distributed with some probability by the Generalized Polynomial Chaos (GPC) approach. In particular, we consider those with forcing functions that have a random parameter in both the scalar and vector case. We then consider linear systems of ODEs with deterministic forcing a...

متن کامل

Random differential inequalities and comparison principles for nonlinear hybrid random differential equations

 In this paper, some basic results concerning strict, nonstrict inequalities, local existence theorem and differential inequalities  have been proved for an IVP of first order hybrid  random differential equations with the linear perturbation of second type. A comparison theorem is proved and  applied to prove the uniqueness of random solution for the considered perturbed random differential eq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of computational dynamics

سال: 2023

ISSN: ['2158-2491', '2158-2505']

DOI: https://doi.org/10.3934/jcd.2022024